Polynomials with Roots modulo Every Integer
نویسندگان
چکیده
Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not the polynomial has a root modulo every non-zero integer.
منابع مشابه
Products Of Quadratic Polynomials With Roots Modulo Any Integer
We classify products of three quadratic polynomials, each irreducible over Q, which are solvable modulo m for every integer m > 1 but have no roots over the rational numbers. Polynomials with this property are known as intersective polynomials. We use Hensel’s Lemma and a refined version of Hensel’s Lemma to complete the proof. Mathematics Subject Classification: 11R09
متن کاملRoots of Polynomials Modulo Prime Powers
To say that R is a root set modulo n means that R is a subset of Z n , the ring of integers modulo n , and there is a polynomial the roots of which modulo n are exactly the elements of R . Note that [ and Z n are always root sets modulo n . It seems that only two papers have appeared which mention the nature of root sets modulo n , and then only at a very basic level : Sierpin ́ ski [3] and Choj...
متن کاملOn Hensel’s Roots and a Factorization Formula in Z[[x]]
Given an odd prime p, we provide formulas for the Hensel lifts of polynomial roots modulo p, and give an explicit factorization over the ring of formal power series with integer coe cients for certain reducible polynomials whose constant term is of the form pw with w > 1. All of our formulas are given in terms of partial Bell polynomials and rely on the inversion formula of Lagrange.
متن کاملOn transitive polynomials modulo integers
A polynomial P (x) with integer coefficients is said to be transitive modulo m, if for every x, y ∈ Z there exists k ≥ 0 such that P (x) = y (mod m). In this paper, we construct new examples of transitive polynomials modulo prime powers and partially describe cubic and quartic transitive polynomials. We also study the orbit structure of affine maps modulo prime powers.
متن کاملSome Results on Gauss Sums
is again a Dirichlet character modulo n. In fact, the set of Dirichlet characters modulo n is again a multiplicative group, called the dual group of (Z/nZ)× and denoted ̂ (Z/nZ)×. The identity element of the dual group, mapping every element of (Z/nZ)× to 1, is the trivial character modulo n, denoted 1n or just 1 when n is clear, Since (Z/nZ)× is a finite group the values taken by any Dirichlet ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996